#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, m, d;
    cin >> n >> m >> d;
    V<int> w(m + 1, 0);
    FOR(i, 1, m) cin >> w[i];

    int x = 0;

    FOR(i, 1, m) {
        x += (d + w[i] - 1);
    }
    x += d;

    if (x < n + 1) {
        NO;
    } else {
        V<int> ans(n + 1, 0);
        YES;

        V<int> suf(m + 2, 0);
        FORD(i, 1, m) suf[i] = suf[i + 1] + w[i];

        x = 0;

        FOR(i, 1, m) {
            int t = suf[i];
            int mn = min(d, (n - x) - t);
            mn = max<int>(mn, 1);
            x += mn;
            FOR(j, x, x + w[i] - 1) {
                ans[j] = i;
            }
            x += w[i] - 1;
        }

        FOR(i, 1, n) cout << ans[i] << " ";
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}